Adaptive One Memory Access Bloom Filters

Bloom filters are widely used to perform fast approximate membership checking in networking applications. The main limitation of is that they suffer from false positives can only be reduced by using more memory. We suggest take advantage a common repetition the identity queried elements adapt for avoiding repeat upon queries. In this paper, one memory access design an adaptation scheme effectively remove while completing all queries single access. proposed well suited scenarios on which number bits per element low and thus complement existing adaptive cuckoo not efficient case. evaluation results packet traces show significantly reduce positive rate applications with particular, when as few four element, rates below 5% achieved.